All Questions
2 questions
3votes
3answers
2kviews
Tower Hopper problem recursive approach
The Tower Hopper problem gives us an array of values representing heights that express how far we can jump from a certain tower, and asks whether there's a way to get from ...
- 1,159
8votes
2answers
2kviews
Counting Increasing Subsequences of size K recursive
The original description of the problem can be found here, its input here and its expected output here. The problem: Given a integer sequence a1 ... an (-10000 \$\leq\$ ai \$\leq\$ 10000). Where ...
user70000
